home *** CD-ROM | disk | FTP | other *** search
- Path: news.eden.com!not-for-mail
- From: fsg@news.eden.com (Felix Sebastian Gallo)
- Newsgroups: comp.lang.misc,comp.lang.perl.misc,comp.lang.tcl,comp.lang.c,comp.lang.java
- Subject: Re: Readable Perl (was: Re: Relative Speed of Perl vs. Tcl vs. C)
- Date: 20 Feb 1996 09:54:59 -0600
- Organization: Adhesive Media, Inc. -- Eden Matrix Online Service
- Message-ID: <4gcqsj$8bg@matrix.eden.com>
- References: <4e3a2u$eoa@wcap.centerline.com> <4e54vc$7sk@orac.mon.rnb.com> <ukd97hwzkc.fsf_-_@linda.teleport.com> <4gb3kp$lu7@gaia.ns.utk.edu>
- NNTP-Posting-Host: matrix.eden.com
-
- Matthew B. Kennel <kennel@msr.epm.ornl.gov> wrote:
- >
- >loop #OUT + "I can count anything: " + collection_class.elt!.str + "\n"; end;
- >
- >Sather.
-
- I know it's not in the spirit of Usenet, but instead of seeing every
- last advocate of every last language post their own particular
- example of how to count readably, might we agree that each of our
- favorite languages has its own space of clear superiority and its
- own weaknesses? And, might we go on to extrapolate that making
- arbitrary comparisons between the languages based on sound-bite
- miniscule algorithms is first-order flawed?
-
- Gentlemen, I tender GALLO'S FIRST LAW OF LANGUAGE DISCUSSION ON THE
- INTERNET for immediate adoption by all advocates of all languages:
-
- No post shall be made which mentions
- a) two or more languages
- and one or more of
- b) the fibonacci algorithm
- c) any kind of sorting algorithm
- d) any algorithm meant to show readability
- e) the words "learning curve"
-
- In the fine Internet tradition, I hereby declare this law 100%
- totally binding, a New Internet Standard, and the benchmark
- yardstick which all rational beings apply to their posts.
- Further, 500 developers have signed up to support this new law,
- and benchmarks indicate that it's 500% faster than the
- competitors' laws.
-
- So kindly stop with the yammering. You too, Tom.
-
- Felix
- go with the floe
-